________________________________________________________________

Run Header: Complete YList Version try 5: /small pw steps

Run start:        31.01.2010 10:25:07
Input Data from:  dataset121.txt
Iteration limit:  500
NI iter. limit:   200

# of Customers  :200
# of Locations  :10
Ex.Facilities   :3
Total budget    :20000
Terror. attacks :2

Penalty Weight : 0,5
Update Policy  : 4-3 of last 10
pw inc. step   : 0,005

Coverage Ratio :0,059
Average f[i]   :3550
Average g[i,j] :1961,90476190476
Total demand   :11080
________________________________________________________________

## ITERATION 0 #######################


> Neighbours evaluated; 29
> Selected Move:	1270	1	-1	9	4500


> New Y[]: 
	
	 2  3  4  0  0  0  0  0  0  1    >new incumb.: 1270


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 1 #######################


> Neighbours evaluated; 34
> Selected Move:	1830	1	-1	7	9000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  0  1    >new incumb.: 1830


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 2 #######################


> Neighbours evaluated; 37
> Selected Move:	2360	1	-1	8	15000


> New Y[]: 
	
	 2  3  4  0  0  0  0  1  1  1    >new incumb.: 2360


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 3 #######################


> Neighbours evaluated; 38
> Selected Move:	2840	1	-1	6	19500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  1  1    >new incumb.: 2840


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 4 #######################


> Neighbours evaluated; 33
> Selected Move:	2810	3	8	5	20000


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 5 #######################


> Neighbours evaluated; 33
> Selected Move:	2760	3	6	3	19500


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,5

## ITERATION 6 #######################


> Neighbours evaluated; 35
> Selected Move:	2790	3	5	8	19000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,495

## ITERATION 7 #######################


> Neighbours evaluated; 35
> Selected Move:	2740	3	8	6	17500


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,49

## ITERATION 8 #######################


> Neighbours evaluated; 34
> Selected Move:	2710	3	7	8	19000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,485

## ITERATION 9 #######################


> Neighbours evaluated; 35
> Selected Move:	2700	3	9	7	19000


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,48

## ITERATION 10 #######################


> Neighbours evaluated; 34
> Selected Move:	2670	3	8	5	19500


> New Y[]: 
	
	 2  3  4  1  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,475

## ITERATION 11 #######################


> Neighbours evaluated; 34
> Selected Move:	2680	3	7	9	19500


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,47

## ITERATION 12 #######################


> Neighbours evaluated; 33
> Selected Move:	2470	3	5	4	18500


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,465

## ITERATION 13 #######################


> Neighbours evaluated; 35
> Selected Move:	2600	3	3	7	19000


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,46

## ITERATION 14 #######################


> Neighbours evaluated; 34
> Selected Move:	2570	3	6	3	18500


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,455

## ITERATION 15 #######################


> Neighbours evaluated; 33
> Selected Move:	2540	3	7	8	20000


> New Y[]: 
	
	 2  3  4  1  1  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,45

## ITERATION 16 #######################


> Neighbours evaluated; 30
> Selected Move:	2530	3	9	7	20000


> New Y[]: 
	
	 2  3  4  1  1  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 17 #######################


> Neighbours evaluated; 31
> Selected Move:	2460	3	8	6	18500


> New Y[]: 
	
	 2  3  4  1  1  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 18 #######################


> Neighbours evaluated; 31
> Selected Move:	2430	3	7	8	20000


> New Y[]: 
	
	 2  3  4  1  1  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 19 #######################


> Neighbours evaluated; 31
> Selected Move:	2353	3	3	9	20500


> New Y[]: 
	
	 2  3  4  0  1  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 20 #######################


> Neighbours evaluated; 28
> Selected Move:	2455	3	6	7	20500


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 21 #######################


> Neighbours evaluated; 27
> Selected Move:	2348	3	9	6	20500


> New Y[]: 
	
	 2  3  4  0  1  0  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 22 #######################


> Neighbours evaluated; 27
> Selected Move:	2270	2	4	-1	15000


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 23 #######################


> Neighbours evaluated; 37
> Selected Move:	2310	3	8	9	13500


> New Y[]: 
	
	 2  3  4  0  0  0  1  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 24 #######################


> Neighbours evaluated; 34
> Selected Move:	2330	3	6	5	15500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 25 #######################


> Neighbours evaluated; 36
> Selected Move:	2300	3	7	8	17000


> New Y[]: 
	
	 2  3  4  0  0  1  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 26 #######################


> Neighbours evaluated; 38
> Selected Move:	2330	1	-1	3	21000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 27 #######################


> Neighbours evaluated; 29
> Selected Move:	2325	3	9	7	21000


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 28 #######################


> Neighbours evaluated; 29
> Selected Move:	2300	3	8	4	20500


> New Y[]: 
	
	 2  3  4  1  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 29 #######################


> Neighbours evaluated; 30
> Selected Move:	2308	3	7	9	20500


> New Y[]: 
	
	 2  3  4  1  1  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 30 #######################


> Neighbours evaluated; 29
> Selected Move:	2230	3	3	7	21000


> New Y[]: 
	
	 2  3  4  0  1  1  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 31 #######################


> Neighbours evaluated; 25
> Selected Move:	2238	3	4	8	21500


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 32 #######################


> Neighbours evaluated; 20
> Selected Move:	2290	2	9	-1	17000


> New Y[]: 
	
	 2  3  4  0  0  1  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 33 #######################


> Neighbours evaluated; 34
> Selected Move:	2240	3	8	6	15500


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 34 #######################


> Neighbours evaluated; 35
> Selected Move:	2250	3	7	9	15500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 35 #######################


> Neighbours evaluated; 35
> Selected Move:	2280	3	5	8	15000


> New Y[]: 
	
	 2  3  4  0  0  0  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 36 #######################


> Neighbours evaluated; 33
> Selected Move:	2230	3	6	3	14500


> New Y[]: 
	
	 2  3  4  1  0  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,445

## ITERATION 37 #######################


> Neighbours evaluated; 34
> Selected Move:	2260	3	8	7	13000


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,44

## ITERATION 38 #######################


> Neighbours evaluated; 32
> Selected Move:	2220	3	9	8	14500


> New Y[]: 
	
	 2  3  4  1  0  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,435

## ITERATION 39 #######################


> Neighbours evaluated; 32
> Selected Move:	2190	3	8	5	15000


> New Y[]: 
	
	 2  3  4  1  0  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,43

## ITERATION 40 #######################


> Neighbours evaluated; 32
> Selected Move:	2200	3	7	9	15000


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,425

## ITERATION 41 #######################


> Neighbours evaluated; 31
> Selected Move:	2180	3	5	6	13000


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 42 #######################


> Neighbours evaluated; 31
> Selected Move:	2170	3	9	7	13000


> New Y[]: 
	
	 2  3  4  1  0  0  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 43 #######################


> Neighbours evaluated; 30
> Selected Move:	2140	3	7	8	14500


> New Y[]: 
	
	 2  3  4  1  0  0  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 44 #######################


> Neighbours evaluated; 32
> Selected Move:	2230	1	-1	5	21000


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 45 #######################


> Neighbours evaluated; 27
> Selected Move:	2210	2	3	-1	17000


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 46 #######################


> Neighbours evaluated; 33
> Selected Move:	2180	1	-1	9	21500


> New Y[]: 
	
	 2  3  4  0  0  1  1  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 47 #######################


> Neighbours evaluated; 21
> Selected Move:	2178	3	9	7	21500


> New Y[]: 
	
	 2  3  4  0  0  1  1  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 48 #######################


> Neighbours evaluated; 20
> Selected Move:	2140	3	8	4	21000


> New Y[]: 
	
	 2  3  4  0  1  1  1  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 49 #######################


> Neighbours evaluated; 26
> Selected Move:	2208	3	7	3	20500


> New Y[]: 
	
	 2  3  4  1  1  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 50 #######################


> Neighbours evaluated; 28
> Selected Move:	2150	3	3	9	21000


> New Y[]: 
	
	 2  3  4  0  1  1  1  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 51 #######################


> Neighbours evaluated; 24
> Selected Move:	2080	2	6	-1	16500


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 52 #######################


> Neighbours evaluated; 34
> Selected Move:	2140	3	5	7	14500


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  0  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 53 #######################


> Neighbours evaluated; 31
> Selected Move:	2110	3	7	8	16000


> New Y[]: 
	
	 2  3  4  0  1  0  0  0  1  1 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 54 #######################


> Neighbours evaluated; 32
> Selected Move:	2100	3	9	7	16000


> New Y[]: 
	
	 2  3  4  0  1  0  0  1  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 55 #######################


> Neighbours evaluated; 32
> Selected Move:	2070	3	8	5	16500


> New Y[]: 
	
	 2  3  4  0  1  1  0  1  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,42

## ITERATION 56 #######################


> Neighbours evaluated; 31
> Selected Move:	2040	3	7	8	18000


> New Y[]: 
	
	 2  3  4  0  1  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,415

## ITERATION 57 #######################


> Neighbours evaluated; 34
> Selected Move:	2160	3	4	3	16500


> New Y[]: 
	
	 2  3  4  1  0  1  0  0  1  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,41

## ITERATION 58 #######################


> Neighbours evaluated; 29
> Selected Move:	2110	3	8	6	15000


> New Y[]: 
	
	 2  3  4  1  0  1  1  0  0  0 


> New S[]: 
	
	 1  1  0  0  0  0  0  0  0  0 
 > pw :0,405

## ITERATION 59 #######################


> Neighbours evaluated; 28
> Selected Move:	2000	3	0	7	17200


> New Y[]: 
	
	 0  3  4  1  0  1  1  2  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,4

## ITERATION 60 #######################


> Neighbours evaluated; 28
> Selected Move:	2140	3	3	9	17700


> New Y[]: 
	
	 0  3  4  0  0  1  1  2  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,395

## ITERATION 61 #######################


> Neighbours evaluated; 26
> Selected Move:	2190	3	6	8	19200


> New Y[]: 
	
	 0  3  4  0  0  1  0  2  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 62 #######################


> Neighbours evaluated; 21
> Selected Move:	2190	4	7	5	17500


> New Y[]: 
	
	 0  3  4  0  0  2  0  1  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 63 #######################


> Neighbours evaluated; 27
> Selected Move:	2190	4	5	8	17100


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  2  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 64 #######################


> Neighbours evaluated; 26
> Selected Move:	2202	1	-1	3	21100


> New Y[]: 
	
	 0  3  4  1  0  1  0  1  2  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 65 #######################


> Neighbours evaluated; 13
> Selected Move:	2600	3	5	6	19100


> New Y[]: 
	
	 0  3  4  1  0  0  1  1  2  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 66 #######################


> Neighbours evaluated; 23
> Selected Move:	2570	3	8	5	20000


> New Y[]: 
	
	 0  3  4  1  0  2  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 67 #######################


> Neighbours evaluated; 29
> Selected Move:	2360	3	5	4	19400


> New Y[]: 
	
	 0  3  4  1  2  0  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 68 #######################


> Neighbours evaluated; 25
> Selected Move:	2216	4	4	9	20400


> New Y[]: 
	
	 0  3  4  1  1  0  1  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 69 #######################


> Neighbours evaluated; 17
> Selected Move:	2285	3	9	8	20100


> New Y[]: 
	
	 0  3  4  1  1  0  1  1  2  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 70 #######################


> Neighbours evaluated; 16
> Selected Move:	2395	3	6	9	20100


> New Y[]: 
	
	 0  3  4  1  1  0  0  1  2  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 71 #######################


> Neighbours evaluated; 18
> Selected Move:	2266	3	7	6	20100


> New Y[]: 
	
	 0  3  4  1  1  0  1  0  2  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 72 #######################


> Neighbours evaluated; 19
> Selected Move:	2250	3	3	7	20600


> New Y[]: 
	
	 0  3  4  0  1  0  1  1  2  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 73 #######################


> Neighbours evaluated; 18
> Selected Move:	2170	2	4	-1	15100


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  2  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 74 #######################


> Neighbours evaluated; 26
> Selected Move:	2170	4	8	6	17500


> New Y[]: 
	
	 0  3  4  0  0  0  2  1  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 75 #######################


> Neighbours evaluated; 25
> Selected Move:	2170	4	6	7	17200


> New Y[]: 
	
	 0  3  4  0  0  0  1  2  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 76 #######################


> Neighbours evaluated; 23
> Selected Move:	2170	4	7	9	16900


> New Y[]: 
	
	 0  3  4  0  0  0  1  1  1  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 77 #######################


> Neighbours evaluated; 26
> Selected Move:	2263	1	-1	3	20900


> New Y[]: 
	
	 0  3  4  1  0  0  1  1  1  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 78 #######################


> Neighbours evaluated; 18
> Selected Move:	2144	4	9	7	21200


> New Y[]: 
	
	 0  3  4  1  0  0  1  2  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 79 #######################


> Neighbours evaluated; 18
> Selected Move:	2120	2	6	-1	16700


> New Y[]: 
	
	 0  3  4  1  0  0  0  2  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,39

## ITERATION 80 #######################


> Neighbours evaluated; 25
> Selected Move:	2120	4	7	3	17000


> New Y[]: 
	
	 0  3  4  2  0  0  0  1  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,385

## ITERATION 81 #######################


> Neighbours evaluated; 25
> Selected Move:	2120	4	3	8	14600


> New Y[]: 
	
	 0  3  4  1  0  0  0  1  2  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,38

## ITERATION 82 #######################


> Neighbours evaluated; 23
> Selected Move:	2120	4	8	9	16400


> New Y[]: 
	
	 0  3  4  1  0  0  0  1  1  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,375

## ITERATION 83 #######################


> Neighbours evaluated; 24
> Selected Move:	2190	3	3	5	18900


> New Y[]: 
	
	 0  3  4  0  0  1  0  1  1  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,37

## ITERATION 84 #######################


> Neighbours evaluated; 22
> Selected Move:	2140	3	8	6	17400


> New Y[]: 
	
	 0  3  4  0  0  1  1  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,365

## ITERATION 85 #######################


> Neighbours evaluated; 24
> Selected Move:	2140	4	9	5	16000


> New Y[]: 
	
	 0  3  4  0  0  2  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,36

## ITERATION 86 #######################


> Neighbours evaluated; 24
> Selected Move:	2140	4	5	6	18000


> New Y[]: 
	
	 0  3  4  0  0  1  2  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 87 #######################


> Neighbours evaluated; 23
> Selected Move:	2100	3	9	8	19500


> New Y[]: 
	
	 0  3  4  0  0  1  2  1  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 88 #######################


> Neighbours evaluated; 19
> Selected Move:	2100	4	6	5	17500


> New Y[]: 
	
	 0  3  4  0  0  2  1  1  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 89 #######################


> Neighbours evaluated; 25
> Selected Move:	2100	4	5	7	19200


> New Y[]: 
	
	 0  3  4  0  0  1  1  2  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 90 #######################


> Neighbours evaluated; 16
> Selected Move:	2100	4	7	8	17100


> New Y[]: 
	
	 0  3  4  0  0  1  1  1  2  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 91 #######################


> Neighbours evaluated; 24
> Selected Move:	2162	1	-1	3	21100


> New Y[]: 
	
	 0  3  4  1  0  1  1  1  2  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 92 #######################


> Neighbours evaluated; 17
> Selected Move:	2147	3	7	9	21100


> New Y[]: 
	
	 0  3  4  1  0  1  1  0  2  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 93 #######################


> Neighbours evaluated; 18
> Selected Move:	2150	3	3	7	21600


> New Y[]: 
	
	 0  3  4  0  0  1  1  1  2  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 94 #######################


> Neighbours evaluated; 13
> Selected Move:	2080	4	1	5	17300


> New Y[]: 
	
	 0  0  4  0  0  3  1  1  2  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,315

## ITERATION 95 #######################


> Neighbours evaluated; 17
> Selected Move:	2140	3	8	0	15700


> New Y[]: 
	
	 2  0  4  0  0  3  1  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 96 #######################


> Neighbours evaluated; 31
> Selected Move:	2570	1	-1	3	19700


> New Y[]: 
	
	 2  0  4  1  0  3  1  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 97 #######################


> Neighbours evaluated; 29
> Selected Move:	2600	3	5	8	19000


> New Y[]: 
	
	 2  0  4  1  0  0  1  1  3  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 98 #######################


> Neighbours evaluated; 30
> Selected Move:	2430	3	6	4	20000


> New Y[]: 
	
	 2  0  4  1  1  0  0  1  3  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 99 #######################


> Neighbours evaluated; 29
> Selected Move:	2325	3	4	5	21000


> New Y[]: 
	
	 2  0  4  1  0  1  0  1  3  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 100 #######################


> Neighbours evaluated; 28
> Selected Move:	2272	4	8	5	21200


> New Y[]: 
	
	 2  0  4  1  0  3  0  1  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 101 #######################


> Neighbours evaluated; 28
> Selected Move:	2253	3	5	4	20600


> New Y[]: 
	
	 2  0  4  1  3  0  0  1  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 102 #######################


> Neighbours evaluated; 28
> Selected Move:	2360	3	8	6	19100


> New Y[]: 
	
	 2  0  4  1  3  0  1  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 103 #######################


> Neighbours evaluated; 27
> Selected Move:	2272	4	4	9	20300


> New Y[]: 
	
	 2  0  4  1  1  0  1  1  0  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 104 #######################


> Neighbours evaluated; 28
> Selected Move:	2368	3	4	8	20800


> New Y[]: 
	
	 2  0  4  1  0  0  1  1  1  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 105 #######################


> Neighbours evaluated; 27
> Selected Move:	2305	4	9	7	21000


> New Y[]: 
	
	 2  0  4  1  0  0  1  3  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 106 #######################


> Neighbours evaluated; 27
> Selected Move:	2210	4	7	3	21300


> New Y[]: 
	
	 2  0  4  3  0  0  1  1  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 107 #######################


> Neighbours evaluated; 26
> Selected Move:	2152	3	3	5	21700


> New Y[]: 
	
	 2  0  4  0  0  3  1  1  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 108 #######################


> Neighbours evaluated; 25
> Selected Move:	2205	4	5	8	21500


> New Y[]: 
	
	 2  0  4  0  0  1  1  1  3  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 109 #######################


> Neighbours evaluated; 27
> Selected Move:	2303	3	5	4	20500


> New Y[]: 
	
	 2  0  4  0  1  0  1  1  3  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 110 #######################


> Neighbours evaluated; 27
> Selected Move:	2320	3	9	3	20000


> New Y[]: 
	
	 2  0  4  1  1  0  1  1  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 111 #######################


> Neighbours evaluated; 26
> Selected Move:	2300	3	7	9	20000


> New Y[]: 
	
	 2  0  4  1  1  0  1  0  3  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 112 #######################


> Neighbours evaluated; 26
> Selected Move:	2195	3	8	7	20500


> New Y[]: 
	
	 2  0  4  1  1  0  1  3  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 113 #######################


> Neighbours evaluated; 25
> Selected Move:	2092	4	7	3	20800


> New Y[]: 
	
	 2  0  4  3  1  0  1  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 114 #######################


> Neighbours evaluated; 24
> Selected Move:	2070	2	4	-1	15300


> New Y[]: 
	
	 2  0  4  3  0  0  1  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 115 #######################


> Neighbours evaluated; 30
> Selected Move:	2170	3	3	8	15000


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  3  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 116 #######################


> Neighbours evaluated; 27
> Selected Move:	2190	3	6	5	17000


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  3  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,355

## ITERATION 117 #######################


> Neighbours evaluated; 29
> Selected Move:	2190	4	8	5	17200


> New Y[]: 
	
	 2  0  4  0  0  3  0  1  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,35

## ITERATION 118 #######################


> Neighbours evaluated; 28
> Selected Move:	2190	4	5	7	19000


> New Y[]: 
	
	 2  0  4  0  0  1  0  3  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 119 #######################


> Neighbours evaluated; 28
> Selected Move:	2190	4	7	9	18800


> New Y[]: 
	
	 2  0  4  0  0  1  0  1  1  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 120 #######################


> Neighbours evaluated; 30
> Selected Move:	2170	3	5	6	16800


> New Y[]: 
	
	 2  0  4  0  0  0  1  1  1  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 121 #######################


> Neighbours evaluated; 29
> Selected Move:	2170	4	9	6	17500


> New Y[]: 
	
	 2  0  4  0  0  0  3  1  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 122 #######################


> Neighbours evaluated; 29
> Selected Move:	2170	4	6	7	17000


> New Y[]: 
	
	 2  0  4  0  0  0  1  3  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 123 #######################


> Neighbours evaluated; 29
> Selected Move:	2140	3	8	5	17500


> New Y[]: 
	
	 2  0  4  0  0  1  1  3  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 124 #######################


> Neighbours evaluated; 29
> Selected Move:	2140	4	7	6	18000


> New Y[]: 
	
	 2  0  4  0  0  1  3  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 125 #######################


> Neighbours evaluated; 28
> Selected Move:	2140	4	6	9	17300


> New Y[]: 
	
	 2  0  4  0  0  1  1  1  0  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 126 #######################


> Neighbours evaluated; 28
> Selected Move:	2167	1	-1	3	21300


> New Y[]: 
	
	 2  0  4  1  0  1  1  1  0  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 127 #######################


> Neighbours evaluated; 25
> Selected Move:	2225	3	9	8	21000


> New Y[]: 
	
	 2  0  4  1  0  1  1  1  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 128 #######################


> Neighbours evaluated; 25
> Selected Move:	2210	3	7	9	21000


> New Y[]: 
	
	 2  0  4  1  0  1  1  0  3  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 129 #######################


> Neighbours evaluated; 25
> Selected Move:	2156	4	8	5	21200


> New Y[]: 
	
	 2  0  4  1  0  3  1  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 130 #######################


> Neighbours evaluated; 25
> Selected Move:	2182	3	9	7	21200


> New Y[]: 
	
	 2  0  4  1  0  3  1  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 131 #######################


> Neighbours evaluated; 24
> Selected Move:	2143	3	5	4	20600


> New Y[]: 
	
	 2  0  4  1  3  0  1  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 132 #######################


> Neighbours evaluated; 25
> Selected Move:	2130	3	3	9	21100


> New Y[]: 
	
	 2  0  4  0  3  0  1  1  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 133 #######################


> Neighbours evaluated; 24
> Selected Move:	2117	3	7	3	20600


> New Y[]: 
	
	 2  0  4  1  3  0  1  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 134 #######################


> Neighbours evaluated; 23
> Selected Move:	1929	3	8	5	21100


> New Y[]: 
	
	 2  0  4  1  3  1  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 135 #######################


> Neighbours evaluated; 26
> Selected Move:	2098	3	4	7	21500


> New Y[]: 
	
	 2  0  4  1  0  1  1  3  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 136 #######################


> Neighbours evaluated; 22
> Selected Move:	2090	2	6	-1	17000


> New Y[]: 
	
	 2  0  4  1  0  1  0  3  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 137 #######################


> Neighbours evaluated; 30
> Selected Move:	2120	3	5	8	16500


> New Y[]: 
	
	 2  0  4  1  0  0  0  3  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 138 #######################


> Neighbours evaluated; 29
> Selected Move:	2120	4	7	3	16800


> New Y[]: 
	
	 2  0  4  3  0  0  0  1  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 139 #######################


> Neighbours evaluated; 28
> Selected Move:	2120	4	3	8	14500


> New Y[]: 
	
	 2  0  4  1  0  0  0  1  3  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 140 #######################


> Neighbours evaluated; 26
> Selected Move:	2120	4	8	9	16300


> New Y[]: 
	
	 2  0  4  1  0  0  0  1  1  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,345

## ITERATION 141 #######################


> Neighbours evaluated; 28
> Selected Move:	2090	3	8	5	16800


> New Y[]: 
	
	 2  0  4  1  0  1  0  1  0  3 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,34

## ITERATION 142 #######################


> Neighbours evaluated; 28
> Selected Move:	2090	4	9	3	17300


> New Y[]: 
	
	 2  0  4  3  0  1  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,335

## ITERATION 143 #######################


> Neighbours evaluated; 27
> Selected Move:	2090	4	3	5	15200


> New Y[]: 
	
	 2  0  4  1  0  3  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,33

## ITERATION 144 #######################


> Neighbours evaluated; 26
> Selected Move:	2169	1	-1	4	20700


> New Y[]: 
	
	 2  0  4  1  1  3  0  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,325

## ITERATION 145 #######################


> Neighbours evaluated; 26
> Selected Move:	2063	3	9	6	20700


> New Y[]: 
	
	 2  0  4  1  1  3  1  1  0  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,32

## ITERATION 146 #######################


> Neighbours evaluated; 25
> Selected Move:	2046	3	3	9	21200


> New Y[]: 
	
	 2  0  4  0  1  3  1  1  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 147 #######################


> Neighbours evaluated; 23
> Selected Move:	2050	3	7	3	20700


> New Y[]: 
	
	 2  0  4  1  1  3  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 148 #######################


> Neighbours evaluated; 23
> Selected Move:	1980	2	4	-1	15200


> New Y[]: 
	
	 2  0  4  1  0  3  1  0  0  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 149 #######################


> Neighbours evaluated; 28
> Selected Move:	2080	3	3	8	17200


> New Y[]: 
	
	 2  0  4  0  0  3  1  0  1  1 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 150 #######################


> Neighbours evaluated; 27
> Selected Move:	2100	3	9	7	17200


> New Y[]: 
	
	 2  0  4  0  0  3  1  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 151 #######################


> Neighbours evaluated; 27
> Selected Move:	2100	4	5	6	19500


> New Y[]: 
	
	 2  0  4  0  0  1  3  1  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 152 #######################


> Neighbours evaluated; 26
> Selected Move:	2100	4	6	7	19000


> New Y[]: 
	
	 2  0  4  0  0  1  1  3  1  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 153 #######################


> Neighbours evaluated; 26
> Selected Move:	2100	4	7	8	17000


> New Y[]: 
	
	 2  0  4  0  0  1  1  1  3  0 


> New S[]: 
	
	 1  0  1  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 154 #######################


> Neighbours evaluated; 26
> Selected Move:	2080	3	0	9	18900


> New Y[]: 
	
	 0  0  4  0  0  1  1  1  3  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,275

## ITERATION 155 #######################


> Neighbours evaluated; 15
> Selected Move:	2080	4	8	5	19100


> New Y[]: 
	
	 0  0  4  0  0  3  1  1  1  2 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,27

## ITERATION 156 #######################


> Neighbours evaluated; 15
> Selected Move:	2080	4	5	9	19300


> New Y[]: 
	
	 0  0  4  0  0  2  1  1  1  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,265

## ITERATION 157 #######################


> Neighbours evaluated; 15
> Selected Move:	2080	4	5	8	18900


> New Y[]: 
	
	 0  0  4  0  0  1  1  1  2  3 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,26

## ITERATION 158 #######################


> Neighbours evaluated; 13
> Selected Move:	2080	4	9	6	19600


> New Y[]: 
	
	 0  0  4  0  0  1  3  1  2  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,255

## ITERATION 159 #######################


> Neighbours evaluated; 13
> Selected Move:	2080	4	6	7	19100


> New Y[]: 
	
	 0  0  4  0  0  1  1  3  2  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,25

## ITERATION 160 #######################


> Neighbours evaluated; 13
> Selected Move:	2080	4	7	8	19200


> New Y[]: 
	
	 0  0  4  0  0  1  1  2  3  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,245

## ITERATION 161 #######################


> Neighbours evaluated; 13
> Selected Move:	2080	4	7	5	17500


> New Y[]: 
	
	 0  0  4  0  0  2  1  1  3  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,24

## ITERATION 162 #######################


> Neighbours evaluated; 13
> Selected Move:	2150	1	-1	3	21500


> New Y[]: 
	
	 0  0  4  1  0  2  1  1  3  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,235

## ITERATION 163 #######################


> Neighbours evaluated; 8
> Selected Move:	2205	4	5	8	21300


> New Y[]: 
	
	 0  0  4  1  0  3  1  1  2  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,23

## ITERATION 164 #######################


> Neighbours evaluated; 10
> Selected Move:	2139	3	5	4	20700


> New Y[]: 
	
	 0  0  4  1  3  0  1  1  2  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,225

## ITERATION 165 #######################


> Neighbours evaluated; 10
> Selected Move:	2098	4	4	8	20900


> New Y[]: 
	
	 0  0  4  1  2  0  1  1  3  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,22

## ITERATION 166 #######################


> Neighbours evaluated; 12
> Selected Move:	1918	3	8	5	21600


> New Y[]: 
	
	 0  0  4  1  2  3  1  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,225

## ITERATION 167 #######################


> Neighbours evaluated; 8
> Selected Move:	1910	4	4	5	21600


> New Y[]: 
	
	 0  0  4  1  3  2  1  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,23

## ITERATION 168 #######################


> Neighbours evaluated; 11
> Selected Move:	1840	2	3	-1	17600


> New Y[]: 
	
	 0  0  4  0  3  2  1  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,235

## ITERATION 169 #######################


> Neighbours evaluated; 15
> Selected Move:	1980	3	4	3	17800


> New Y[]: 
	
	 0  0  4  3  0  2  1  1  0  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,24

## ITERATION 170 #######################


> Neighbours evaluated; 15
> Selected Move:	2030	3	6	8	19300


> New Y[]: 
	
	 0  0  4  3  0  2  0  1  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,245

## ITERATION 171 #######################


> Neighbours evaluated; 15
> Selected Move:	2080	3	3	6	20000


> New Y[]: 
	
	 0  0  4  0  0  2  3  1  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,25

## ITERATION 172 #######################


> Neighbours evaluated; 11
> Selected Move:	2080	4	5	6	19700


> New Y[]: 
	
	 0  0  4  0  0  3  2  1  1  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,255

## ITERATION 173 #######################


> Neighbours evaluated; 12
> Selected Move:	2080	4	5	8	19500


> New Y[]: 
	
	 0  0  4  0  0  1  2  1  3  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,25

## ITERATION 174 #######################


> Neighbours evaluated; 13
> Selected Move:	2030	3	6	3	19000


> New Y[]: 
	
	 0  0  4  2  0  1  0  1  3  1 


> New S[]: 
	
	 0  0  1  0  0  0  0  1  0  0 
 > pw :0,245

## ITERATION 175 #######################


> Neighbours evaluated; 16
> Selected Move:	2090	3	8	1	17500


> New Y[]: 
	
	 0  3  4  2  0  1  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 176 #######################


> Neighbours evaluated; 25
> Selected Move:	2090	4	3	5	15500


> New Y[]: 
	
	 0  3  4  1  0  2  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 177 #######################


> Neighbours evaluated; 25
> Selected Move:	2268	1	-1	8	21500


> New Y[]: 
	
	 0  3  4  1  0  2  0  1  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 178 #######################


> Neighbours evaluated; 22
> Selected Move:	2255	3	5	6	21500


> New Y[]: 
	
	 0  3  4  1  0  0  2  1  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 179 #######################


> Neighbours evaluated; 16
> Selected Move:	2263	4	6	3	21500


> New Y[]: 
	
	 0  3  4  2  0  0  1  1  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 180 #######################


> Neighbours evaluated; 19
> Selected Move:	2230	3	3	5	22000


> New Y[]: 
	
	 0  3  4  0  0  2  1  1  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,215

## ITERATION 181 #######################


> Neighbours evaluated; 15
> Selected Move:	2208	3	9	3	21500


> New Y[]: 
	
	 0  3  4  1  0  2  1  1  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,22

## ITERATION 182 #######################


> Neighbours evaluated; 24
> Selected Move:	2180	3	7	9	21500


> New Y[]: 
	
	 0  3  4  1  0  2  1  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,225

## ITERATION 183 #######################


> Neighbours evaluated; 24
> Selected Move:	2098	3	5	4	20900


> New Y[]: 
	
	 0  3  4  1  2  0  1  0  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,23

## ITERATION 184 #######################


> Neighbours evaluated; 23
> Selected Move:	2223	3	6	7	20900


> New Y[]: 
	
	 0  3  4  1  2  0  0  1  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,235

## ITERATION 185 #######################


> Neighbours evaluated; 22
> Selected Move:	2131	3	3	6	21400


> New Y[]: 
	
	 0  3  4  0  2  0  1  1  1  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,24

## ITERATION 186 #######################


> Neighbours evaluated; 21
> Selected Move:	2104	3	9	3	20900


> New Y[]: 
	
	 0  3  4  1  2  0  1  1  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,245

## ITERATION 187 #######################


> Neighbours evaluated; 23
> Selected Move:	1947	3	8	5	21400


> New Y[]: 
	
	 0  3  4  1  2  1  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,25

## ITERATION 188 #######################


> Neighbours evaluated; 20
> Selected Move:	2220	3	4	9	21400


> New Y[]: 
	
	 0  3  4  1  0  1  1  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,255

## ITERATION 189 #######################


> Neighbours evaluated; 19
> Selected Move:	2137	4	9	7	21700


> New Y[]: 
	
	 0  3  4  1  0  1  1  2  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,26

## ITERATION 190 #######################


> Neighbours evaluated; 17
> Selected Move:	2178	3	5	4	20700


> New Y[]: 
	
	 0  3  4  1  1  0  1  2  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,265

## ITERATION 191 #######################


> Neighbours evaluated; 20
> Selected Move:	2095	4	7	3	21000


> New Y[]: 
	
	 0  3  4  2  1  0  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,27

## ITERATION 192 #######################


> Neighbours evaluated; 17
> Selected Move:	2090	4	3	6	21000


> New Y[]: 
	
	 0  3  4  1  1  0  2  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,275

## ITERATION 193 #######################


> Neighbours evaluated; 20
> Selected Move:	2125	3	6	5	21000


> New Y[]: 
	
	 0  3  4  1  1  2  0  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,28

## ITERATION 194 #######################


> Neighbours evaluated; 22
> Selected Move:	2010	3	3	6	21500


> New Y[]: 
	
	 0  3  4  0  1  2  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,285

## ITERATION 195 #######################


> Neighbours evaluated; 17
> Selected Move:	2005	3	9	3	21000


> New Y[]: 
	
	 0  3  4  1  1  2  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,29

## ITERATION 196 #######################


> Neighbours evaluated; 22
> Selected Move:	2000	2	4	-1	15500


> New Y[]: 
	
	 0  3  4  1  0  2  1  1  0  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,295

## ITERATION 197 #######################


> Neighbours evaluated; 23
> Selected Move:	2070	3	5	9	14900


> New Y[]: 
	
	 0  3  4  1  0  0  1  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,3

## ITERATION 198 #######################


> Neighbours evaluated; 23
> Selected Move:	2090	3	6	5	16900


> New Y[]: 
	
	 0  3  4  1  0  1  0  1  0  2 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 199 #######################


> Neighbours evaluated; 22
> Selected Move:	2090	4	9	7	17200


> New Y[]: 
	
	 0  3  4  1  0  1  0  2  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 200 #######################


> Neighbours evaluated; 21
> Selected Move:	2070	3	5	6	15200


> New Y[]: 
	
	 0  3  4  1  0  0  1  2  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,315

## ITERATION 201 #######################


> Neighbours evaluated; 21
> Selected Move:	2070	4	7	3	15500


> New Y[]: 
	
	 0  3  4  2  0  0  1  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,31

## ITERATION 202 #######################


> Neighbours evaluated; 22
> Selected Move:	2070	4	3	6	15500


> New Y[]: 
	
	 0  3  4  1  0  0  2  1  0  1 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,305

## ITERATION 203 #######################


> Neighbours evaluated; 22
> Selected Move:	2030	3	9	8	17000


> New Y[]: 
	
	 0  3  4  1  0  0  2  1  1  0 


> New S[]: 
	
	 0  1  1  0  0  0  0  0  0  0 
 > pw :0,3
________________________________________________________________

Best solution found: 2840
Run Termination time: 31.01.2010 10:25:54
Run duration: 00:00:46.4843750
________________________________________________________________
